Programming in three-valued logic

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming in Three-valued Logic

The aim of this paper is to propose a logical and algebraic theory which seems well-suited to logic programs with negatior, and deductive databases. This theory has similar properties to those of Prolog theory limited to programs with Horn clauses and tbns can be considered as sn extension of the usual theory. This parallel with logic programming without negation lies in the introduction of a t...

متن کامل

Learning Three-Valued Logic Programs

We show that the adoption of a three-valued setting for inductive concept learning is particularly useful for learning. Distinguishing between what is true, what is false and what is unknown can be useful in situations where decisions have to be taken on the basis of scarce information. In order to learn in a three-valued setting, we adopt Extended Logic Programs (ELP) under a Well-Founded Sema...

متن کامل

Three-valued Logics in Modal Logic

Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any threevalued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In gene...

متن کامل

Complete Extensions in Argumentation Coincide with Three-Valued Stable Models in Logic Programming

In this paper, we prove the correspondence between complete extensions in abstract argumentation and 3-valued stable models in logic programming. This result is in line with earlier work of [8] that identified the correspondence between the grounded extension in abstract argumentation and the well-founded model in logic programming, as well as between the stable extensions in abstract argumenta...

متن کامل

Algebraization of the Three-valued BCK-logic

In this paper a definition of n-valued system in the context of the algebraizable logics is proposed. We define and study the variety V3, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three-valued BCK-logic”. As a consequence we find an axiomatic definition of the above system. Mathematics Subject Classification: 03B50, 03G25, 06F35.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1991

ISSN: 0304-3975

DOI: 10.1016/0304-3975(51)90008-4